Generating Trees and Other Combinatorial Objects Lexicographically
نویسندگان
چکیده
منابع مشابه
Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases
In order to find Nash-equilibria for two-player zero-sum games where each player plays combinatorial objects like spanning trees, matchings etc, we consider two online learning algorithms: the online mirror descent (OMD) algorithm and the multiplicative weights update (MWU) algorithm. The OMD algorithm requires the computation of a certain Bregman projection, that has closed form solutions for ...
متن کاملBalanced Incomplete Block Designs and Other Combinatorial Objects
Suppose we have a committee composed of a large number of members, and from this committee we wish to create a number of smaller subcommittees, each containing exactly the same number of members. Furthermore, in order to preserve equality and keep all committee members happy, each member must sit on exactly the same number of subcommittees and each pair of members must also sit on the same numb...
متن کاملGenerating functions for generating trees
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. Generating trees lead to a fast computation of enumeration sequences (sometimes, to explicit formulae as well) and provide efficient random generation al...
متن کاملGenerating trees and forbidden subsequences
We discuss an enumerative technique called generating frees which was introduced in the study of Baxter permutations. We apply the technique to some other classes of permutations with forbidden subsequences. We rederive some known results, e.g. ]S,(132,231)[ = 2” and l&,(123,132,213)1 = F,, and add several new ones: &(123,3241), S,(123,3214),8,(123,2143). Finally, we argue for the broader use o...
متن کاملConstruction of Combinatorial Objects
Isomorphism problems often can be solved by determining orbits of a group acting on the set of all objects to be classiied. The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle. Especially it is shown that forming Sims chains, using an algorithmic version of Burnside's table of marks, computing double coset representatives, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1979
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0208006